/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 86185
 * Date: 2023-05-12
 * Time: 21:32
 */
public class HashBuck<K, V> {
    static class Node<K, V> {
        private K key;
        private V val;
        private Node(K key, V val) {
            this.key = key;
            this.val = val;
        }
        private Node<K, V> next;
    }
    public Node<K, V>[] array = (Node<K, V>[])new Node[10];
    public int usedSize;
    private static final float DEFAULT_LOUD_FACTOR = 0.75f;
    public void put(K key, V val) {
        Node<K, V> node = new Node<>(key, val);
        int hash = key.hashCode();
        int index = hash % array.length;//控制在合理范围之内
        Node<K, V> cur = array[index];
        while (cur != null) {
            if (cur.key .equals(key)) {
                cur.val = val;
                return;
            }
            cur = cur.next;
        }
        node.next = array[index];
        array[index] = node;
        usedSize++;
//        if(getLoudFactor() >= DEFAULT_LOUD_FACTOR) {
//            resize();
//        }
    }
    private float getLoudFactor() {
        return usedSize * 1.0f / array.length;
    }
    public V get(K key) {
        int hash = key.hashCode();
        int index = hash % array.length;
        Node<K, V> cur = array[index];
        while (cur != null) {
            if (cur.key .equals(key)) {
                return cur.val;
            }
            cur = cur.next;
        }
        return null;
    }
}
